A Method to Translate Order-Sorted Algebras to Many-Sorted Algebras
نویسندگان
چکیده
منابع مشابه
A Method to Translate Order-Sorted Algebras to Many-Sorted Algebras
Order-sorted algebras and many sorted algebras exist in a long history with many different implementations and applications. A lot of language specifications have been defined in order-sorted algebra frameworks such as the language specifications in K (an order-sorted algebra framework). The biggest problem in a lot of the order-sorted algebra frameworks is that even if they might allow develop...
متن کاملMany Sorted Algebras
The basic purpose of the paper is to prepare preliminaries of the theory of many sorted algebras. The concept of the signature of a many sorted algebra is introduced as well as the concept of many sorted algebra itself. Some auxiliary related notions are defined. The correspondence between (1 sorted) universal algebras [8] and many sorted algebras with one sort only is described by introducing ...
متن کاملOrder Sorted Algebras
In this paper i is a set. Let I be a set, let f be a many sorted set indexed by I, and let p be a finite sequence of elements of I. One can check that f · p is finite sequence-like. Let S be a non empty many sorted signature. A sort symbol of S is an element of S. Let S be a non empty many sorted signature. (Def. 1) An element of the operation symbols of S is said to be an operation symbol of S...
متن کاملOn the Trivial Many Sorted Algebras and Many Sorted Congruences
In this paper a, I denote sets and S denotes a non empty non void many sorted signature. The scheme MSSExD deals with a non empty set A and a binary predicate P , and states that: There exists a many sorted set f indexed by A such that for every element i of A holds P [i, f (i)] provided the following condition is met: • For every element i of A there exists a set j such that P [i, j]. Let I be...
متن کاملProducts of Many Sorted Algebras
For simplicity we follow the rules: I, J denote sets, A, B denote many sorted sets of I, i, j, x are arbitrary, and S denotes a non empty many sorted signature. A set has common domain if: (Def.1) For all functions f , g such that f ∈ it and g ∈ it holds dom f = dom g. Let us mention that there exists a set which is functional and non empty and has common domain. The following proposition is tr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2018
ISSN: 2075-2180
DOI: 10.4204/eptcs.265.3